The Complexity of Finding
نویسندگان
چکیده
We identify two properties that for P-selective sets are effectively computable. Namely we show that, for any P-selective set, finding a string that is in a given length’s top Toda equivalence class (very informally put, a string from Σ that the set’s P-selector function declares to be most likely to belong to the set) is FP p 2 computable, and we show that each P-selective set contains a weakly-P p 2 -rankable subset.
منابع مشابه
On the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملThe Impact of Pre-task Planning Vs. On-line Planning on Writing Performance: A Test of Accuracy, Fluency, and Complexity
The aim of the current study was to compare the influence of on-line planning and pre-task planning on the performance of EFL university students enjoying different levels of proficiency regarding accuracy, fluency and complexity. To this end a group of 134 EFL learners with different proficiency levels were asked to write narrative tasks under two planning conditions (Pre-task planning and on-...
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملExtension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher
Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...
متن کاملکاربرد کانون ارزیابی و تحلیل شغل در تعیین شایستگی‌های مدیریتی
The aim of the current research was to determine Assessment Center (AC) competencies and dimensions via job analysis and provide consistency of assessor's judgment, also determine relation between job complexity and AC dimensions. Statistical population consisted of all managers of the different organizations of Isfahan, whom 200 mangers were selected via convenient method and assessors were tr...
متن کاملAn improved and efficient stenographic scheme based on matrix embedding using BCH syndrome coding.
This paper presents a new stenographic scheme based on matrix embedding using BCH syndrome coding. The proposed method embeds massage into cover by changing some coefficients of cover. In this paper defining a number :::as char:::acteristic of the syndrome, which is invariant with respect to the cyclic shift, we propose a new embedding algorithm base on BCH syndrome coding, without finding ro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004